On Perfect Powers in Lucas Sequences
نویسندگان
چکیده
Let (un)n≥0 be the binary recurrent sequence of integers given by u0 = 0, u1 = 1 and un+2 = 2(un+1 + un). We show that the only positive perfect powers in this sequence are u1 = 1 and u4 = 16. We also discuss the problem of determining perfect powers in Lucas sequences in general.
منابع مشابه
Powers in Lucas Sequences via Galois Representations
Let un be a nondegenerate Lucas sequence. We generalize the results of Bugeaud, Mignotte, and Siksek [6] to give a systematic approach towards the problem of determining all perfect powers in any particular Lucas sequence. We then prove a general bound on admissible prime powers in a Lucas sequence assuming the Frey-Mazur conjecture on isomorphic mod p Galois representations of elliptic curves.
متن کاملFibonacci Numbers at Most One Away from a Perfect Power
The famous problem of determining all perfect powers in the Fibonacci sequence and the Lucas sequence has recently been resolved by three of the present authors. We sketch the proof of this result, and we apply it to show that the only Fibonacci numbers Fn such that Fn ± 1 is a perfect power are 0, 1, 2, 3, 5 and 8. The proof of the Fibonacci Perfect Powers Theorem involves very deep mathematic...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملPerfect Powers from Products of Terms in Lucas Sequences
Suppose that {Un}n≥0 is a Lucas sequence, and suppose that l1, . . . , lt are primes. We show that the equation Un1 · · ·Unm = ±l x1 1 · · · l xt t y , p prime, m < p, has only finitely many solutions. Moreover, we explain a practical method of solving these equations. For example, if {Fn}n≥0 is the Fibonacci sequence, then we solve the equation Fn1 · · ·Fnm = 2 x1 · 32 · 53 · · · 541100y under...
متن کاملClassical and modular approaches to exponential Diophantine equations I. Fibonacci and Lucas perfect powers
This is the first in a series of papers whereby we combine the classical approach to exponential Diophantine equations (linear forms in logarithms, Thue equations, etc.) with a modular approach based on some of the ideas of the proof of Fermat’s Last Theorem. In this paper we give new improved bounds for linear forms in three logarithms. We also apply a combination of classical techniques with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006